#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N], b[N];
void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  rep(i, 1, n) cin >> b[i];
  stack<int> st;
  int i = 1, j = 1;
  while (j <= n) {
    if (st.empty() || st.top() != b[j]) {
      if (i > n) {
        cout << "No" << endl;
        return;
      }
      st.push(a[i++]);
    } else {
      st.pop();
      ++j;
    }
  }
  cout << "Yes" << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}